Core Discussion Paper 2000/12 New Upper Bounds for Maximum-entropy Sampling
نویسندگان
چکیده
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer’s inequality. Further new upper bounds combine the use of Fischer’s inequality with previously developed bounds. We demonstrate this in detail by using the partitioning idea to strengthen the spectral bounds of Ko, Lee and Queyranne and of Lee. Computational evidence suggests that these bounds may be useful in solving problems to optimality in a branch-and-bound framework.
منابع مشابه
New Upper Bounds for Maximum - Entropy Sampling
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the use of Fischer's inequality with previously developed bounds. We demonstrate this in detail by using the partitioning idea to strengthen the spectral bounds of Ko, Lee and Queyranne and of Lee. Computat...
متن کاملNew Upper Bounds for Maximum -
We develop and experiment with new upper bounds for the constrained maximum-entropy sampling problem. Our partition bounds are based on Fischer's inequality. Further new upper bounds combine the use of Fischer's inequality with previously developed bounds. We demonstrate this in detail by using the partitioning idea to strengthen the spectral bounds of Ko, Lee and Queyranne and of Lee. Computat...
متن کاملCompressed Secret Key Agreement: Maximizing Multivariate Mutual Information per Bit
The multiterminal secret key agreement problem by public discussion is formulated with an additional source compression step where, prior to the public discussion phase, users independently compress their private sources to filter out strongly correlated components in order to generate a common secret key. The objective is to maximize the achievable key rate as a function of the joint entropy o...
متن کاملSome New Properties for Degree-Based Graph Entropies
The graph entropies inspired by Shannon’s entropy concept become the information-theoretic quantities for measuring the structural information of graphs and complex networks. In this paper, we continue studying some new properties of the graph entropies based on information functionals involving vertex degrees. We prove the monotonicity of the graph entropies with respect to the power exponent....
متن کاملA note on inequalities for Tsallis relative operator entropy
In this short note, we present some inequalities for relative operator entropy which are generalizations of some results obtained by Zou [Operator inequalities associated with Tsallis relative operator entropy, {em Math. Inequal. Appl.} {18} (2015), no. 2, 401--406]. Meanwhile, we also show some new lower and upper bounds for relative operator entropy and Tsallis relative o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000